Weighted Graph Laplacian and Image Inpainting
نویسندگان
چکیده
Abstract. Inspired by the graph Laplacian and the point integral method, we introduce a novel weighted graph Laplacian method to compute a smooth interpolation function on a point cloud in high dimensional space. The numerical results in semi-supervised learning and image inpainting show that the weighted graph Laplacian is a reliable and efficient interpolation method. In addition, it is easy to implement and faster than graph Laplacian.
منابع مشابه
Low Dimensional Manifold Model with Semi-local Patches
Abstract. In this paper we integrate semi-local patches and the weighted graph Laplacian [17] into the framework of the low dimensional manifold model [12]. This approach is much faster than the original LDMM algorithm. The number of iterations is typically reduced from 100 to 10 and the equations in each step are much easier to solve. This new approach is tested in image inpainting and denoisi...
متن کاملOn Eccentricity Version of Laplacian Energy of a Graph
The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian matrix of G and the average degree of the vertices of G. Motivated by the work from Sharafdini an...
متن کاملNonlocal infinity Laplacian equation on graphs with applications in image processing and machine learning
In this paper, an adaptation of the infinity Laplacian equation to weighted graphs is proposed. This adaptation leads to a nonlocal artial difference equation on graphs, which is an extension of the well-known approximations of the infinity Laplacian equation. o do so, we study the limit as p tends to infinity of minimizers of p-harmonic function on graphs. We also prove the existence and nique...
متن کاملA Graph Framework for Manifold-Valued Data
Recently, there has been a strong ambition to translate models and algorithms from traditional image processing to non-Euclidean domains, e.g., to manifold-valued data. While the task of denoising has been extensively studied in the last years, there was rarely an attempt to perform image inpainting on manifold-valued data. In this paper we present a nonlocal inpainting method for manifold-valu...
متن کاملMultiview Hessian discriminative sparse coding for image annotation
Sparse coding represents a signal sparsely by using an overcomplete dictionary, and obtains promising performance in practical computer vision applications, especially for signal restoration tasks such as image denoising and image inpainting. In recent years, many discriminative sparse coding algorithms have been developed for classification problems, but they cannot naturally handle visual dat...
متن کامل